A note on extended quadratic residue codes over GF (9) and their ternary imagesBEENKER, G. F. M.IEEE transactions on information theory. 1984, Vol 30, Num 2, pp 403-405, issn 0018-9448Article

Completely regular codes and completely transitive codes; Codes complètement réguliers et codes complètement transitifsSOLE, Patrick.Rapports de recherche - INRIA. 1987, Vol 727, issn 0249-6399, 9 p.Report

Self-dual doubly circulant codesVENTOU, M; RIGONI, C.Discrete mathematics. 1985, Vol 56, Num 2-3, pp 291-298, issn 0012-365XArticle

Regular universal codeword setsCAPOCELLI, R. M; DE SANTIS, A.IEEE transactions on information theory. 1986, Vol 32, Num 1, pp 129-133, issn 0018-9448Article

Equidistant binary arithmetic codesCLARK, W. E; LIANG, J. J.IEEE transactions on information theory. 1986, Vol 32, Num 1, pp 106-108, issn 0018-9448Article

Maximum distance separable multilevel codesDA ROCHA, V. C. JR.IEEE transactions on information theory. 1984, Vol 30, Num 3, pp 547-548, issn 0018-9448Article

Single-error-correcting perfect and near perfect AN codes in symmetric multivalued number representationGOTO, M.Transactions of the Institute of Electronics and Communication Engineers of Japan. Section E. 1984, Vol 67, Num 7, pp 359-362, issn 0387-236XArticle

On generating the N-ary reflected Gray codesER, M. C.IEEE transactions on computers. 1984, Vol 33, Num 8, pp 739-741, issn 0018-9340Article

Single error correcting and multiple unidirectional error detecting cyclic an arithmetic codesGAITANIS, N.Electronics Letters. 1984, Vol 20, Num 15, pp 638-640, issn 0013-5194Article

On the covering radius of cyclic linear codes and arithmetic codesHELLESETH, T.Discrete applied mathematics. 1985, Vol 11, Num 2, pp 157-173, issn 0166-218XArticle

Expressions de certains codes de Reed-Solomon étendus en tant que H-codes = Expressions of some Reed Solomon codes extended as H-codesPONS, R.Revue du CETHEDEC. 1983, Vol 20, Num 75, pp 35-48, issn 0035-2535Article

Linear unequal error protection codes from shorter codesVAN GILS, W. J.IEEE transactions on information theory. 1984, Vol 30, Num 3, pp 544-546, issn 0018-9448Article

Multigram codesGILBERT, E. N; MONMA, C. L.IEEE transactions on information theory. 1983, Vol 28, Num 2, pp 346-348, issn 0018-9448Article

Run-length-limited variants of duobinary and modified duobinaryDAE YOUNG KIM; JE IN BAEK; JAE-KYOON KIM et al.IEEE transactions on communications. 1987, Vol 35, Num 2, pp 142-150, issn 0090-6778Conference Paper

Duadic codesLEON, J. S; MASLEY, J. M; PLESS, V et al.IEEE transactions on information theory. 1984, Vol 30, Num 5, pp 709-714, issn 0018-9448Article

On a class of Abelian codesPRABIR BHATTACHARYA.Information sciences. 1984, Vol 33, Num 3, pp 173-179, issn 0020-0255Article

Automorphisms of principal nilpotent self-dual codes in ceratin modular algebrasPOLI, A; THIONG-LY, J. A.Discrete mathematics. 1985, Vol 56, Num 2-3, pp 265-273, issn 0012-365XArticle

Modified Berger codes for detection of unidirectional errorsHAO DONG.IEEE transactions on computers. 1984, Vol 33, Num 6, pp 572-575, issn 0018-9340Article

Some periodic convolutional codes better than any fixed codeMOOSER, M.IEEE transactions on information theory. 1983, Vol 29, Num 5, pp 750-751, issn 0018-9448Article

Dual product constructions of Reed―Muller type codesPHELPS, K. T.IEEE transactions on information theory. 1986, Vol 32, Num 1, pp 103-106, issn 0018-9448Article

CODES PARFAITS ET UNIFORMEMENT EMPILES.COHEN G; DEZA M.1976; REV. CETHEDOC; FR.; DA. 1976; VOL. 13; NO 49; PP. 35-44; BIBL. 2 P.Article

A general product construction for error correcting codesPHELPS, K. T.SIAM journal on algebraic and discrete methods. 1984, Vol 5, Num 2, pp 224-228, issn 0196-5212Article

Codes for write-once memoriesMERKX, Frans.1981, 50 p.Report

On a conjecture on Reed-Muller codesSIRI KRISHAN WASAN; GAMES, R. A.International journal of electronics. 1984, Vol 56, Num 2, pp 269-271, issn 0020-7217Article

On the parameters of Goppa codesWIRTZ, M.IEEE transactions on information theory. 1988, Vol 34, Num 5, pp 1341-1343, issn 0018-9448Article